Analysis of Transmissions Scheduling with Packet Fragmentation
نویسندگان
چکیده
We investigate a scheduling problem in which packets, or datagrams, may be fragmented. While there are a few applications to scheduling with datagram fragmentation, our model of the problem is derived from a scheduling problem present in data over CATV networks. In the scheduling problem datagrams of variable lengths must be assigned (packed) into fixed length time slots. One of the capabilities of the system is the ability to break a datagram into several fragments. When a datagram is fragmented, extra bits are added to the original datagram to enable the reassembly of all the fragments.
منابع مشابه
Performance evaluation of MIMO-aware media access control protocol
Multiple-Input and Multiple-Output (MIMO) systems are recently being recognized for achieving simultaneous transmissions on wireless channels that overlap in time. As a result, new scheduling mechanisms are required that coordinate these multiple transmissions among wireless stations which share a single wireless channel. This paper proposes a new distributed MIMO-aware media access control (MA...
متن کاملCross-layer Packet-dependant OFDM Scheduling Based on Proportional Fairness
This paper assumes each user has more than one queue, derives a new packet-dependant proportional fairness power allocation pattern based on the sum of weight capacity and the packet’s priority in users’ queues, and proposes 4 new cross-layer packet-dependant OFDM scheduling schemes based on proportional fairness for heterogeneous classes of traffic. Scenario 1, scenario 2 and scenario 3 lead r...
متن کاملScheduling packet transmissions in a multi-hop packet switched network based on message length
This paper describes two algorithms for scheduling packets in a multi-hop network. The objective of the algorithms is to reduce end-to-end message (not packet) transmission delays. Both algorithms schedule packet transmissions based on the length of the original message that the packet belongs to. The first algorithm is preemptive and is based on the shortest-message-first principle and the sec...
متن کاملRouting and Scheduling File Transfers in Packet-switched Networks
Data traac in networks has always been dominated by le transfers, an observation that has motivated previous work in scheduling le transfers. While these previous research contributions address le transfers, they do not address the special considerations required of packet-switched networks, in particular the issues of routing and of simultaneous transmissions of les. In this paper, we generali...
متن کاملOpportunistic Nonorthogonal Packet Scheduling in Fixed Broadband Wireless Access Networks
In order to mitigate high cochannel interference resulting from dense channel reuse, the interference management issues are often considered as essential part of scheduling schemes in fixed broadband wireless access (FBWA) networks. To that end, a series of literature has been published recently, in which a group of base stations forms an interferer group (downlink transmissions from each base ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics & Theoretical Computer Science
دوره 4 شماره
صفحات -
تاریخ انتشار 2001